Epsilon-net method for optimizations over separable states
نویسندگان
چکیده
منابع مشابه
Epsilon-Net Method for Optimizations over Separable States
We give algorithms for the optimization problem: maxρ 〈Q, ρ〉, where Q is a Hermitian matrix, and the variable ρ is a bipartite separable quantum state. This problem lies at the heart of several problems in quantum computation and information, such as the complexity of QMA(2). While the problem is NPhard, our algorithms are better than brute force for several instances of interest. In particular...
متن کاملNew epsilon-net constructions
In this paper, we give simple and intuitive constructions to obtain linear size -nets for α-fat wedges, translations and rotations of a quadrant and axis-parallel three-sided rectangles in R. We also give new constructions using elementary geometry to obtain linear size weak -net for d-hypercubes and disks in R.
متن کاملMultiplication operators on Banach modules over spectrally separable algebras
Let $mathcal{A}$ be a commutative Banach algebra and $mathscr{X}$ be a left Banach $mathcal{A}$-module. We study the set ${rm Dec}_{mathcal{A}}(mathscr{X})$ of all elements in $mathcal{A}$ which induce a decomposable multiplication operator on $mathscr{X}$. In the case $mathscr{X}=mathcal{A}$, ${rm Dec}_{mathcal{A}}(mathcal{A})$ is the well-known Apostol algebra of $mathcal{A}$. We s...
متن کاملExplicit product ensembles for separable quantum states
We present a general method for constructing pure-product-state representations for density operators of N quantum bits. If such a representation has nonnegative expansion coefficients, it provides an explicit separable ensemble for the density operator. We derive the condition for separability of a mixture of the GreenbergerHorne-Zeilinger state with the maximally mixed state.
متن کاملDistinguishing separable and entangled states.
We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the more complicated tests are strictly stronger. The new criteria are tractable due to powerful computational and theoretical methods for the class of convex opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.03.031